An optimal algorithm for computing all subtree repeats in trees
نویسندگان
چکیده
منابع مشابه
An optimal algorithm for computing all subtree repeats in trees
Given a labelled tree T, our goal is to group repeating subtrees of T into equivalence classes with respect to their topologies and the node labels. We present an explicit, simple and time-optimal algorithm for solving this problem for unrooted unordered labelled trees and show that the running time of our method is linear with respect to the size of T. By unordered, we mean that the order of t...
متن کاملAn Optimal Algorithm for the Indirect Covering Subtree Problem
We consider the indirect covering subtree problem (Kim et al., 1996). The input is an edge weighted tree graph along with customers located at the nodes. Each customer is associated with a radius and a penalty. The goal is to locate a tree-shaped facility such that the sum of setup and penalty cost is minimized. The setup cost equals the sum of edge lengths taken by the facility and the penalty...
متن کاملComputing an Optimal Layout for Cone Trees
Many visual representations for trees have been developed in information and software visualization. One of them are cone trees, a well-known three-dimensional representation for trees. This paper is based on an approach for constructing cone trees bottom-up. For this approach, an optimal layout for these trees is given together with a proof that based on the assumptions, there can be no better...
متن کاملSubtree Weight Ratios for Optimal Binary Search Trees
For an optimal binary search tree T with a subtree S(d) at a distance d from the root of T, we study the ratio of the weight of S(d) to the weight of T. The maximum possible value, which we call ρ(d), of the ratio of weights, is found to have an upper bound of 2/Fd+3 where Fi is the ith Fibonacci number. For d = 1, 2, 3, and 4, the bound is shown to be tight. For larger d, the Fibonacci bound g...
متن کاملOptimal Bounds for Computing α-gapped Repeats
Following (Kolpakov et al., 2013; Gawrychowski and Manea, 2015), we continue the study of α-gapped repeats in strings, defined as factors uvu with |uv| ≤ α|u|. Our main result is the O(αn) bound on the number of maximal α-gapped repeats in a string of length n, previously proved to be O(αn) in (Kolpakov et al., 2013). For a closely related notion of maximal δ-subrepetition (maximal factors of e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
سال: 2014
ISSN: 1364-503X,1471-2962
DOI: 10.1098/rsta.2013.0140